منابع مشابه
Total domination versus paired domination
A dominating set of a graph G is a vertex subset that any vertex of G either belongs to or is adjacent to. A total dominating set is a dominating set whose induced subgraph does not contain isolated vertices. The minimal size of a total dominating set, the total domination number, is denoted by γt. The maximal size of an inclusionwise minimal total dominating set, the upper total domination num...
متن کاملComplexity of Comparing the Domination Number to the Independent Domination, Connected Domination, and Paired Domination Numbers
The domination number γ(G), the independent domination number ι(G), the connected domination number γc(G), and the paired domination number γp(G) of a graph G (without isolated vertices, if necessary) are related by the simple inequalities γ(G) ≤ ι(G), γ(G) ≤ γc(G), and γ(G) ≤ γp(G). Very little is known about the graphs that satisfy one of these inequalities with equality. I.E. Zverovich and V...
متن کاملA characterization of trees with equal total domination and paired-domination numbers
Let G = (V,E) be a graph without isolated vertices. A set S ⊆ V is a total dominating set if every vertex in V is adjacent to at least one vertex in S. A total dominating set S ⊆ V is a paired-dominating set if the induced subgraph G[S] has at least one perfect matching. The paired-domination number γpr(G) is the minimum cardinality of a paired-domination set of G. In this paper, we provide a c...
متن کاملInequalities Involving Independence Domination , / - Domination , Connected and Total / - Domination Numbers
Let / be an integer-valued function defined on the vertex set V(G) of a graph G. A subset D of V(G) is an /-dominating set if each vertex x outside D is adjacent to at least f(x) vertices in D. The minimum number of vertices in an /-dominating set is denned to be the /-domination number, denoted by 7/(G). In a similar way one can define the connected and total /-domination numbers 7 C| /(G) and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2012
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1614